Primitive multiple schemes
نویسندگان
چکیده
A primitive multiple scheme is a Cohen–Macaulay Y such that the associated reduced $$X=Y_{\mathrm{red}}$$ smooth, irreducible, and can be locally embedded in smooth variety of dimension $$\dim (X)+1$$ . If n multiplicity Y, there canonical filtration $$X=X_1\subset X_2\subset \cdots \subset X_n=Y$$ , $$X_i$$ i. The simplest example trivial to line bundle L on X: it nth infinitesimal neighborhood X, $$L^*$$ by zero section. Let schemes are obtained taking an open cover $$(U_i)$$ X gluing $$U_i\,{\times }\, \mathbf{Z}_n$$ using automorphisms $$U_{ij}\,{\times leave $$U_{ij}$$ invariant. This leads study sheaf nonabelian groups $$X\,{\times invariant, its first cohomology set. $$n\geqslant 2$$ obstruction extension $$X_n$$ $$n+1$$ which lies second group $$H^2(X,E)$$ suitable vector E X. In this paper we these obstructions parametrization schemes. As show if $$X={{\mathbb {P}}}_m$$ with $$m\geqslant 3$$ all trivial. {P}}}_2$$ only two nontrivial schemes, multiplicities 2 4, not quasi-projective. On other hand, projective over curve, infinite sequences $$ X=X_1\subset X_n\subset X_{n+1}\subset
منابع مشابه
Origin Tracking in Primitive Recursive Schemes
Algebraic speciications of programming languages can be used to generate language-speciic programming support tools. Some of these can be obtained in a straightforward way by executing language speciications as term rewriting systems. More advanced tools can be obtained if the term rewriting machinery is extended with origin tracking. Origin tracking is a technique which automatically establish...
متن کاملCentrum Voor Wiskunde En Informatica Reportrapport Origin Tracking in Primitive Recursive Schemes Origin Tracking in Primitive Recursive Schemes
Algebraic speciications of programming languages can be used to generate language-speciic programming support tools. Some of these can be obtained in a straightforward way by executing language speciications as term rewriting systems. More advanced tools can be obtained if the term rewriting machinery is extended with origin tracking. Origin tracking is a technique which automatically establish...
متن کاملA modular absolute bound condition for primitive association schemes
The well-known absolute bound condition for a primitive symmetric association scheme (X,S) gives an upper bound for |X| in terms of |S| and the minimal non-principal multiplicity of the scheme. In this paper we prove another upper bounds for |X| for an arbitrary primitive scheme (X,S). They do not depend on |S| but depend on some invariants of its adjacency algebra KS where K is an algebraic nu...
متن کاملOn primitive symmetric association schemes with m1=3
We classify primitive symmetric association schemes with m1 = 3. Namely, it is shown that the tetrahedron, i.e., the association scheme of the complete graph K4, is the unique such association scheme. Our proof of this result is based on the spherical embeddings of association schemes and elementary three dimensional Euclidean geometry.
متن کاملMultiple Access Schemes
1 Communication channels are major components of computer communication networks. They provide the physical mediums over which signals, representing data, are transmitted from one node of the network to another node. Communication channels can be classiied into two main categories: point-to-point channels and shared channels. Typically, the backbone of wide area networks (WANs) consists of poin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European journal of mathematics
سال: 2021
ISSN: ['2199-675X', '2199-6768']
DOI: https://doi.org/10.1007/s40879-020-00447-4